A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
نویسندگان
چکیده
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points where a linear or quadratic function is non-negative) by regularized boolean operations. The algorithm and its implementation are complete (they can handle all cases), exact (they give the mathematically correct result), and efficient (they can handle inputs with several hundred primitives).
منابع مشابه
RE2L: An Efficient Output-sensitive Algorithm for Computing Boolean Operation on Circular-arc Polygons
The boundaries of conic polygons consist of conic segments or second degree curves. The conic polygon has two degenerate or special cases: the linear polygon and the circular-arc polygon. The natural problem — boolean operation on linear polygons, has been well studied. Surprisingly, (almost) no article focuses on the problem of boolean operation on circular-arc polygons, which actually can als...
متن کاملExact and approximate construction of offset polygons
The Minkowski sum of two sets A, B ∈ R2, denoted A ⊕ B, is defined as {a + b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation of the construction of the Minkowski sum of a polygon in R2 with a disc, an operation known as offsetting the polygon. Our software package includes a procedure for computing the exact offset of a straight-edge polygon, based on the arrangement of coni...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملA conic quadratic model for supply chain network design under hub, capacity, delay and lost sale
In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Minimizing the symmetric difference distance in conic spline approximation
We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with non-vanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 +O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the affine curvature of...
متن کامل